Extensions of Proximity Functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Fuzzy Extensions of Functions

We proposed the theory of multi-fuzzy sets [Sabu and Ramakrishnan (2010a), (2011a)] as an extension of theories of fuzzy sets, L-fuzzy sets [Goguen (1967)] and intuitionistic fuzzy sets [Atanassov (1986)]. Theory of multi-fuzzy sets deals with multi-level fuzziness and multi-dimensional fuzziness. Our previous papers discussed the basic notions of multi-fuzzy sets, multi-fuzzy topology, and mul...

متن کامل

An analysis of learned proximity functions

A lot of recent work has shown that the proximity of terms can be exploited to improve the performance of information retrieval systems. We review a recent approach that uses an intuitive framework to incorporate proximity functions into vector based information retrieval systems. More importantly, we present several proximity functions that were learned within this framework and show that they...

متن کامل

Proximity theorems of discrete convex functions

Aproximity theorem is astatement that, given an optimization problem and its relaxation, an optimal solution to the original problem exists in acertain neighborhood of asolution to the relaxation. Proximity theorems have been used successfully, for example, in designing efficient algorithms for discrete resource allocation problems. After reviewing the recent results for $\mathrm{L}$-convex and...

متن کامل

Proximity for Sums of Composite Functions

We propose an algorithm for computing the proximity operator of a sum of composite convex functions in Hilbert spaces and investigate its asymptotic behavior. Applications to best approximation and image recovery are described.

متن کامل

Bidual Horn Functions and Extensions

Partially defined Boolean functions (pdBf) , where are disjoint sets of true and false vectors, generalize total Boolean functions by allowing that the function values on some input vectors are unknown. The main issue with pdBfs is the extension problem, which is deciding, given a pdBf, whether it is interpolated by a function from a given class of total Boolean functions, and computing a formu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1970

ISSN: 0002-9939

DOI: 10.2307/2036402